Comparison of the Message-Passing Algorithm SCCC and LDPC code for PMR Channel
نویسندگان
چکیده
In storage system, the higher density perpendicular magnetic recording (PMR) channel requires more advanced signal setection method to satisfy the bit error rate performance. Recently the iterative decoding is in the limelight part of the coding theory for the storage system. Famous iterative codes are the LDPC code and the Turbo code. In this paper, we consider the serial concatenated convolutional code (SCCC) with the messagepassing algorithm. LDPC code has the inner iterations by using Sum-Product Algorithm (SPA). The iterative decoding of LDPC code leads to increase the performance of the PMR channel. Meanwhile, the SCCC system has no inner iterations. Therefore we consider the channel iteration between channel detector and channel decoder in SCCC system. This iterative decoding scheme expects to improve the performance of the PMR channel. We increase the number of the channel iterations in order to improve the performance.
منابع مشابه
Constructions and performance of classes of quantum LDPC codes
Two methods for constructing quantum LDPC codes are presented. We explain how to overcome the difficulty of finding a set of low weight generators for the stabilizer group of the code. Both approaches are based on some graph representation of the generators of the stabilizer group and on simple local rules that ensure commutativity. A message passing algorithm for generic quantum LDPC codes is ...
متن کاملError Performance of Decoding of LDPC over AWGN Channel
The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...
متن کاملA Cycle Search Algorithm for an LDPC Code Design
A message-passing based search algorithm for cycles in a Tanner graph is proposed for designing good lowdensity parity-check (LDPC) codes. By applying the message-passing algorithm with only two message alphabets to a cycle search, we can easily perform the cycle search for a good LDPC code with an existing message-passing decoder.
متن کاملAdaptive message-passing decoding: ways to implement and limits of applicability
I n this report we study the decoding algorithms for a family of codes called LDPC codes used over the binary erasure channel (BEC). LDPC codes are able to work at rates near Shannon capacity with linear time decoding algorithms. Those linear time decoding algorithms sometimes fail even when Gaussian elimination would still be able to restore the codeword. In this report we try to experimentall...
متن کاملLow-Density Parity-Check Code with Fast Decoding Speed
Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes [7]. An important design issue for LDPC codes is designing codes with fast decoding speed while maintaining capacityapproaching performance. In another words, it is desirable that the c...
متن کامل